TSTP Solution File: SEV491^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV491^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:43:23 EDT 2024
% Result : Theorem 0.17s 0.43s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 34
% Syntax : Number of formulae : 181 ( 2 unt; 15 typ; 0 def)
% Number of atoms : 1920 ( 458 equ; 0 cnn)
% Maximal formula atoms : 18 ( 11 avg)
% Number of connectives : 3454 ( 250 ~; 382 |; 69 &;2715 @)
% ( 14 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 144 ( 144 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 24 usr; 15 con; 0-6 aty)
% Number of variables : 302 ( 0 ^ 267 !; 26 ?; 302 :)
% ( 9 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(type_def_7,type,
sK2: $tType ).
thf(type_def_8,type,
sK3: $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/HAS_SIZE':
!>[X0: $tType] : ( ( X0 > $o ) > 'type/nums/num' > $o ) ).
thf(func_def_3,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
'const/sets/CARD':
!>[X0: $tType] : ( ( X0 > $o ) > 'type/nums/num' ) ).
thf(func_def_8,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( X1 > X0 ) > ( X0 > X1 ) > ( X1 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_9,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( X1 > X0 ) > ( X0 > X1 ) > ( X1 > $o ) > ( X0 > $o ) > X1 ) ).
thf(func_def_10,type,
sK4: sK2 > $o ).
thf(func_def_11,type,
sK5: sK3 > $o ).
thf(func_def_12,type,
sK6: sK2 > sK3 ).
thf(func_def_13,type,
sK7: sK3 > sK2 ).
thf(func_def_15,type,
ph9:
!>[X0: $tType] : X0 ).
thf(f533,plain,
$false,
inference(avatar_sat_refutation,[],[f46,f98,f118,f200,f233,f323,f326,f333,f353,f377,f381,f402,f406,f414,f483,f489,f516,f532]) ).
thf(f532,plain,
( spl8_3
| ~ spl8_4
| ~ spl8_10
| ~ spl8_11
| ~ spl8_12 ),
inference(avatar_split_clause,[],[f531,f224,f220,f216,f91,f88]) ).
thf(f88,plain,
( spl8_3
<=> ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
thf(f91,plain,
( spl8_4
<=> ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
thf(f216,plain,
( spl8_10
<=> ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_10])]) ).
thf(f220,plain,
( spl8_11
<=> ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_11])]) ).
thf(f224,plain,
( spl8_12
<=> ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_12])]) ).
thf(f531,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) ) )
| ~ spl8_4
| ~ spl8_10
| ~ spl8_11
| ~ spl8_12 ),
inference(subsumption_resolution,[],[f530,f217]) ).
thf(f217,plain,
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) )
| ~ spl8_10 ),
inference(avatar_component_clause,[],[f216]) ).
thf(f530,plain,
( ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) ) )
| ~ spl8_4
| ~ spl8_11
| ~ spl8_12 ),
inference(subsumption_resolution,[],[f529,f221]) ).
thf(f221,plain,
( ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ~ spl8_11 ),
inference(avatar_component_clause,[],[f220]) ).
thf(f529,plain,
( ! [X0: 'type/nums/num'] :
( ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
!= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) ) )
| ~ spl8_4
| ~ spl8_12 ),
inference(subsumption_resolution,[],[f525,f225]) ).
thf(f225,plain,
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) )
| ~ spl8_12 ),
inference(avatar_component_clause,[],[f224]) ).
thf(f525,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) )
| ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
!= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
| ~ spl8_4 ),
inference(binary_proxy_clausification,[],[f523]) ).
thf(f523,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
!= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
| ~ spl8_4 ),
inference(trivial_inequality_removal,[],[f522]) ).
thf(f522,plain,
( ! [X0: 'type/nums/num'] :
( ( ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 )
!= ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) )
| ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
!= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
| ~ spl8_4 ),
inference(superposition,[],[f27,f518]) ).
thf(f518,plain,
( ( ( sK7 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
= ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ~ spl8_4 ),
inference(trivial_inequality_removal,[],[f517]) ).
thf(f517,plain,
( ( $true != $true )
| ( ( sK7 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
= ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ~ spl8_4 ),
inference(superposition,[],[f29,f92]) ).
thf(f92,plain,
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) )
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f29,plain,
! [X7: sK2] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ X7 @ sK4 ) )
| ( ( sK7 @ ( sK6 @ X7 ) )
= X7 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ! [X6: sK3] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ X6 @ sK5 ) )
| ( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK7 @ X6 ) @ sK4 ) )
& ( ( sK6 @ ( sK7 @ X6 ) )
= X6 ) ) )
& ( ( 'const/sets/CARD' @ sK3 @ sK5 )
!= ( 'const/sets/CARD' @ sK2 @ sK4 ) )
& ( ( $true
= ( 'const/sets/FINITE' @ sK3 @ sK5 ) )
| ( $true
= ( 'const/sets/FINITE' @ sK2 @ sK4 ) ) )
& ! [X7: sK2] :
( ( ( ( sK7 @ ( sK6 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK6 @ X7 ) @ sK5 ) ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ X7 @ sK4 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7])],[f15,f20]) ).
thf(f20,plain,
( ? [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ! [X6: X1] :
( ( $true
!= ( 'const/sets/IN' @ X1 @ X6 @ X3 ) )
| ( ( $true
= ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ( ( 'const/sets/CARD' @ X0 @ X2 )
!= ( 'const/sets/CARD' @ X1 @ X3 ) )
& ( ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
& ! [X7: X0] :
( ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
!= $true ) ) )
=> ( ! [X6: sK3] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ X6 @ sK5 ) )
| ( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK7 @ X6 ) @ sK4 ) )
& ( ( sK6 @ ( sK7 @ X6 ) )
= X6 ) ) )
& ( ( 'const/sets/CARD' @ sK3 @ sK5 )
!= ( 'const/sets/CARD' @ sK2 @ sK4 ) )
& ( ( $true
= ( 'const/sets/FINITE' @ sK3 @ sK5 ) )
| ( $true
= ( 'const/sets/FINITE' @ sK2 @ sK4 ) ) )
& ! [X7: sK2] :
( ( ( ( sK7 @ ( sK6 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK6 @ X7 ) @ sK5 ) ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ X7 @ sK4 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f15,plain,
? [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ! [X6: X1] :
( ( $true
!= ( 'const/sets/IN' @ X1 @ X6 @ X3 ) )
| ( ( $true
= ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ( ( 'const/sets/CARD' @ X0 @ X2 )
!= ( 'const/sets/CARD' @ X1 @ X3 ) )
& ( ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
& ! [X7: X0] :
( ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
!= $true ) ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
? [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ( 'const/sets/CARD' @ X0 @ X2 )
!= ( 'const/sets/CARD' @ X1 @ X3 ) )
& ! [X6: X1] :
( ( $true
!= ( 'const/sets/IN' @ X1 @ X6 @ X3 ) )
| ( ( $true
= ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ( ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
& ! [X7: X0] :
( ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
~ ! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X6: X1] :
( ( $true
= ( 'const/sets/IN' @ X1 @ X6 @ X3 ) )
=> ( ( $true
= ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ( ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
& ! [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true )
=> ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) ) ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X2 )
= ( 'const/sets/CARD' @ X1 @ X3 ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X6: X1] :
( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
| ( 'const/sets/FINITE' @ X1 @ X3 ) )
& ! [X7: X0] :
( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
=> ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
& ( ( X5 @ ( X4 @ X7 ) )
= X7 ) ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X2 )
= ( 'const/sets/CARD' @ X1 @ X3 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: $tType,X3: $tType,X1: X0 > $o,X2: X3 > $o,X4: X0 > X3,X5: X3 > X0] :
( ( ! [X6: X3] :
( ( 'const/sets/IN' @ X3 @ X6 @ X2 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X1 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
| ( 'const/sets/FINITE' @ X3 @ X2 ) )
& ! [X6: X0] :
( ( 'const/sets/IN' @ X0 @ X6 @ X1 )
=> ( ( 'const/sets/IN' @ X3 @ ( X4 @ X6 ) @ X2 )
& ( ( X5 @ ( X4 @ X6 ) )
= X6 ) ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X1 )
= ( 'const/sets/CARD' @ X3 @ X2 ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: $tType,X3: $tType,X1: X0 > $o,X2: X3 > $o,X4: X0 > X3,X5: X3 > X0] :
( ( ! [X6: X3] :
( ( 'const/sets/IN' @ X3 @ X6 @ X2 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X1 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
| ( 'const/sets/FINITE' @ X3 @ X2 ) )
& ! [X6: X0] :
( ( 'const/sets/IN' @ X0 @ X6 @ X1 )
=> ( ( 'const/sets/IN' @ X3 @ ( X4 @ X6 ) @ X2 )
& ( ( X5 @ ( X4 @ X6 ) )
= X6 ) ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X1 )
= ( 'const/sets/CARD' @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LvEyTWJTzM/Vampire---4.8_6330','thm/sets/BIJECTIONS_CARD_EQ_') ).
thf(f27,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X8: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 ) )
| ( ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X5 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f19,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ( ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 ) )
| ( ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X5 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) ) )
& ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 ) ) )
| ( ( ( ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true ) )
& ( $true
= ( 'const/sets/IN' @ X1 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 ) ) )
| ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f18,f17]) ).
thf(f17,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X6: X0] :
( ( ( ( 'const/sets/IN' @ X1 @ ( X4 @ X6 ) @ X3 )
!= $true )
| ( ( X5 @ ( X4 @ X6 ) )
!= X6 ) )
& ( $true
= ( 'const/sets/IN' @ X0 @ X6 @ X2 ) ) )
=> ( ( ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 ) )
| ( ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X5 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) ) )
& ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f18,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X7: X1] :
( ( ( ( X4 @ ( X5 @ X7 ) )
!= X7 )
| ( $true
!= ( 'const/sets/IN' @ X0 @ ( X5 @ X7 ) @ X2 ) ) )
& ( $true
= ( 'const/sets/IN' @ X1 @ X7 @ X3 ) ) )
=> ( ( ( ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true ) )
& ( $true
= ( 'const/sets/IN' @ X1 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f16,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X6: X0] :
( ( ( ( 'const/sets/IN' @ X1 @ ( X4 @ X6 ) @ X3 )
!= $true )
| ( ( X5 @ ( X4 @ X6 ) )
!= X6 ) )
& ( $true
= ( 'const/sets/IN' @ X0 @ X6 @ X2 ) ) )
| ? [X7: X1] :
( ( ( ( X4 @ ( X5 @ X7 ) )
!= X7 )
| ( $true
!= ( 'const/sets/IN' @ X0 @ ( X5 @ X7 ) @ X2 ) ) )
& ( $true
= ( 'const/sets/IN' @ X1 @ X7 @ X3 ) ) )
| ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) ) ),
inference(rectify,[],[f13]) ).
thf(f13,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X7: X0] :
( ( ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) )
| ( ( X5 @ ( X4 @ X7 ) )
!= X7 ) )
& ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true ) )
| ? [X6: X1] :
( ( ( ( X4 @ ( X5 @ X6 ) )
!= X6 )
| ( $true
!= ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) ) )
& ( $true
= ( 'const/sets/IN' @ X1 @ X6 @ X3 ) ) )
| ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) )
| ? [X7: X0] :
( ( ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) )
| ( ( X5 @ ( X4 @ X7 ) )
!= X7 ) )
& ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true ) )
| ? [X6: X1] :
( ( ( ( X4 @ ( X5 @ X6 ) )
!= X6 )
| ( $true
!= ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) ) )
& ( $true
= ( 'const/sets/IN' @ X1 @ X6 @ X3 ) ) ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true )
=> ( ( $true
= ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) )
& ( ( X5 @ ( X4 @ X7 ) )
= X7 ) ) )
& ! [X6: X1] :
( ( $true
= ( 'const/sets/IN' @ X1 @ X6 @ X3 ) )
=> ( ( $true
= ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) ) )
=> ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X6: X1] :
( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
=> ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ! [X7: X0] :
( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
=> ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
& ( ( X5 @ ( X4 @ X7 ) )
= X7 ) ) ) )
=> ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X3: $tType,X1: X0 > $o,X2: X3 > $o,X4: X0 > X3,X5: X3 > X0] :
( ( ! [X6: X3] :
( ( 'const/sets/IN' @ X3 @ X6 @ X2 )
=> ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X1 )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ! [X6: X0] :
( ( 'const/sets/IN' @ X0 @ X6 @ X1 )
=> ( ( 'const/sets/IN' @ X3 @ ( X4 @ X6 ) @ X2 )
& ( ( X5 @ ( X4 @ X6 ) )
= X6 ) ) ) )
=> ! [X6: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X6 )
= ( 'const/sets/HAS_SIZE' @ X3 @ X2 @ X6 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LvEyTWJTzM/Vampire---4.8_6330','thm/sets/BIJECTIONS_HAS_SIZE_EQ_') ).
thf(f516,plain,
( spl8_4
| spl8_3
| ~ spl8_11
| ~ spl8_12 ),
inference(avatar_split_clause,[],[f513,f224,f220,f88,f91]) ).
thf(f513,plain,
( ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) ) )
| ~ spl8_11
| ~ spl8_12 ),
inference(subsumption_resolution,[],[f512,f225]) ).
thf(f512,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) ) )
| ~ spl8_11 ),
inference(binary_proxy_clausification,[],[f510]) ).
thf(f510,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) ) )
| ~ spl8_11 ),
inference(trivial_inequality_removal,[],[f508]) ).
thf(f508,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 )
!= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) ) )
| ~ spl8_11 ),
inference(superposition,[],[f26,f221]) ).
thf(f26,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X8: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X5 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) )
| ( $true
= ( 'const/sets/IN' @ X1 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f489,plain,
( spl8_3
| spl8_13
| spl8_14 ),
inference(avatar_split_clause,[],[f488,f320,f316,f88]) ).
thf(f316,plain,
( spl8_13
<=> ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_13])]) ).
thf(f320,plain,
( spl8_14
<=> ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_14])]) ).
thf(f488,plain,
( ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| spl8_13
| spl8_14 ),
inference(subsumption_resolution,[],[f487,f317]) ).
thf(f317,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| spl8_13 ),
inference(avatar_component_clause,[],[f316]) ).
thf(f487,plain,
( ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| spl8_14 ),
inference(binary_proxy_clausification,[],[f485]) ).
thf(f485,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) ) )
| spl8_14 ),
inference(trivial_inequality_removal,[],[f484]) ).
thf(f484,plain,
( ! [X0: 'type/nums/num'] :
( ( $true != $true )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) ) )
| spl8_14 ),
inference(superposition,[],[f322,f24]) ).
thf(f24,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X8: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( $true
= ( 'const/sets/IN' @ X1 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f322,plain,
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| spl8_14 ),
inference(avatar_component_clause,[],[f320]) ).
thf(f483,plain,
( ~ spl8_2
| ~ spl8_6 ),
inference(avatar_split_clause,[],[f482,f115,f43]) ).
thf(f43,plain,
( spl8_2
<=> ( $true
= ( 'const/sets/FINITE' @ sK3 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
thf(f115,plain,
( spl8_6
<=> ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_6])]) ).
thf(f482,plain,
( ( $true
!= ( 'const/sets/FINITE' @ sK3 @ sK5 ) )
| ~ spl8_6 ),
inference(subsumption_resolution,[],[f472,f31]) ).
thf(f31,plain,
( ( 'const/sets/CARD' @ sK3 @ sK5 )
!= ( 'const/sets/CARD' @ sK2 @ sK4 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f472,plain,
( ( $true
!= ( 'const/sets/FINITE' @ sK3 @ sK5 ) )
| ( ( 'const/sets/CARD' @ sK3 @ sK5 )
= ( 'const/sets/CARD' @ sK2 @ sK4 ) )
| ~ spl8_6 ),
inference(trivial_inequality_removal,[],[f449]) ).
thf(f449,plain,
( ( ( 'const/sets/CARD' @ sK3 @ sK5 )
= ( 'const/sets/CARD' @ sK2 @ sK4 ) )
| ( $true = $false )
| ( $true
!= ( 'const/sets/FINITE' @ sK3 @ sK5 ) )
| ~ spl8_6 ),
inference(superposition,[],[f37,f430]) ).
thf(f430,plain,
( ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( ( 'const/sets/CARD' @ sK2 @ sK4 )
= X0 ) )
| ~ spl8_6 ),
inference(trivial_inequality_removal,[],[f420]) ).
thf(f420,plain,
( ! [X0: 'type/nums/num'] :
( ( $true != $true )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( ( 'const/sets/CARD' @ sK2 @ sK4 )
= X0 ) )
| ~ spl8_6 ),
inference(superposition,[],[f36,f116]) ).
thf(f116,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| ~ spl8_6 ),
inference(avatar_component_clause,[],[f115]) ).
thf(f36,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
!= $true ) )
& ( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
!= X2 )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f22]) ).
thf(f22,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
!= $true ) )
& ( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
!= X2 )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ) ),
inference(nnf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) )
<=> ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 ) ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LvEyTWJTzM/Vampire---4.8_6330','thm/sets/HAS_SIZE_') ).
thf(f37,plain,
! [X0: $tType,X1: X0 > $o] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ ( 'const/sets/CARD' @ X0 @ X1 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ),
inference(equality_resolution,[],[f34]) ).
thf(f34,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
!= X2 )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f414,plain,
( spl8_3
| spl8_13
| ~ spl8_14
| ~ spl8_16 ),
inference(avatar_split_clause,[],[f413,f399,f320,f316,f88]) ).
thf(f399,plain,
( spl8_16
<=> ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_16])]) ).
thf(f413,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) ) )
| ~ spl8_14
| ~ spl8_16 ),
inference(subsumption_resolution,[],[f392,f400]) ).
thf(f400,plain,
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) )
| ~ spl8_16 ),
inference(avatar_component_clause,[],[f399]) ).
thf(f392,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) ) )
| ~ spl8_14 ),
inference(binary_proxy_clausification,[],[f390]) ).
thf(f390,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) ) )
| ~ spl8_14 ),
inference(trivial_inequality_removal,[],[f388]) ).
thf(f388,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 )
!= ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) ) )
| ~ spl8_14 ),
inference(superposition,[],[f25,f383]) ).
thf(f383,plain,
( ( ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 )
= ( sK6 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) ) )
| ~ spl8_14 ),
inference(trivial_inequality_removal,[],[f382]) ).
thf(f382,plain,
( ( $true != $true )
| ( ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 )
= ( sK6 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) ) )
| ~ spl8_14 ),
inference(superposition,[],[f32,f321]) ).
thf(f321,plain,
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| ~ spl8_14 ),
inference(avatar_component_clause,[],[f320]) ).
thf(f32,plain,
! [X6: sK3] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ X6 @ sK5 ) )
| ( ( sK6 @ ( sK7 @ X6 ) )
= X6 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f25,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X8: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK1 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f406,plain,
( ~ spl8_14
| spl8_16 ),
inference(avatar_contradiction_clause,[],[f405]) ).
thf(f405,plain,
( $false
| ~ spl8_14
| spl8_16 ),
inference(subsumption_resolution,[],[f404,f321]) ).
thf(f404,plain,
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| spl8_16 ),
inference(trivial_inequality_removal,[],[f403]) ).
thf(f403,plain,
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| ( $true != $true )
| spl8_16 ),
inference(superposition,[],[f401,f33]) ).
thf(f33,plain,
! [X6: sK3] :
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK7 @ X6 ) @ sK4 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ X6 @ sK5 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f401,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) )
| spl8_16 ),
inference(avatar_component_clause,[],[f399]) ).
thf(f402,plain,
( ~ spl8_16
| spl8_6
| ~ spl8_13
| ~ spl8_14
| ~ spl8_15 ),
inference(avatar_split_clause,[],[f397,f374,f320,f316,f115,f399]) ).
thf(f374,plain,
( spl8_15
<=> ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_15])]) ).
thf(f397,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) ) )
| ~ spl8_13
| ~ spl8_14
| ~ spl8_15 ),
inference(subsumption_resolution,[],[f396,f337]) ).
thf(f337,plain,
( ( ( sK7 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
= ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) )
| ~ spl8_13 ),
inference(trivial_inequality_removal,[],[f336]) ).
thf(f336,plain,
( ( $true != $true )
| ( ( sK7 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
= ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) )
| ~ spl8_13 ),
inference(superposition,[],[f29,f318]) ).
thf(f318,plain,
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ~ spl8_13 ),
inference(avatar_component_clause,[],[f316]) ).
thf(f396,plain,
( ! [X0: 'type/nums/num'] :
( ( ( sK7 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
!= ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) ) )
| ~ spl8_14
| ~ spl8_15 ),
inference(subsumption_resolution,[],[f394,f375]) ).
thf(f375,plain,
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) )
| ~ spl8_15 ),
inference(avatar_component_clause,[],[f374]) ).
thf(f394,plain,
( ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) )
| ( ( sK7 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
!= ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
| ~ spl8_14 ),
inference(binary_proxy_clausification,[],[f393]) ).
thf(f393,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) )
| ( ( sK7 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
!= ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| ~ spl8_14 ),
inference(trivial_inequality_removal,[],[f389]) ).
thf(f389,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK4 ) )
| ( ( sK7 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
!= ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) )
| ( ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 )
!= ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
| ~ spl8_14 ),
inference(superposition,[],[f27,f383]) ).
thf(f381,plain,
( ~ spl8_13
| spl8_15 ),
inference(avatar_contradiction_clause,[],[f380]) ).
thf(f380,plain,
( $false
| ~ spl8_13
| spl8_15 ),
inference(subsumption_resolution,[],[f379,f318]) ).
thf(f379,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| spl8_15 ),
inference(trivial_inequality_removal,[],[f378]) ).
thf(f378,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( $true != $true )
| spl8_15 ),
inference(superposition,[],[f376,f28]) ).
thf(f28,plain,
! [X7: sK2] :
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK6 @ X7 ) @ sK5 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ X7 @ sK4 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f376,plain,
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) )
| spl8_15 ),
inference(avatar_component_clause,[],[f374]) ).
thf(f377,plain,
( spl8_6
| ~ spl8_15
| ~ spl8_13
| spl8_14 ),
inference(avatar_split_clause,[],[f372,f320,f316,f374,f115]) ).
thf(f372,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) ) )
| ~ spl8_13
| spl8_14 ),
inference(subsumption_resolution,[],[f369,f322]) ).
thf(f369,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) ) )
| ~ spl8_13 ),
inference(binary_proxy_clausification,[],[f368]) ).
thf(f368,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) ) )
| ~ spl8_13 ),
inference(trivial_inequality_removal,[],[f365]) ).
thf(f365,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) @ sK5 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| ( ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 )
!= ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) ) )
| ~ spl8_13 ),
inference(superposition,[],[f26,f337]) ).
thf(f353,plain,
( ~ spl8_5
| spl8_12 ),
inference(avatar_contradiction_clause,[],[f352]) ).
thf(f352,plain,
( $false
| ~ spl8_5
| spl8_12 ),
inference(subsumption_resolution,[],[f351,f97]) ).
thf(f97,plain,
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f95]) ).
thf(f95,plain,
( spl8_5
<=> ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_5])]) ).
thf(f351,plain,
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| spl8_12 ),
inference(trivial_inequality_removal,[],[f350]) ).
thf(f350,plain,
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| ( $true != $true )
| spl8_12 ),
inference(superposition,[],[f226,f33]) ).
thf(f226,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK4 ) )
| spl8_12 ),
inference(avatar_component_clause,[],[f224]) ).
thf(f333,plain,
( spl8_6
| spl8_13
| spl8_14 ),
inference(avatar_split_clause,[],[f331,f320,f316,f115]) ).
thf(f331,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| spl8_14 ),
inference(binary_proxy_clausification,[],[f330]) ).
thf(f330,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| spl8_14 ),
inference(trivial_inequality_removal,[],[f329]) ).
thf(f329,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true != $true ) )
| spl8_14 ),
inference(superposition,[],[f322,f24]) ).
thf(f326,plain,
( spl8_11
| ~ spl8_5 ),
inference(avatar_split_clause,[],[f325,f95,f220]) ).
thf(f325,plain,
( ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f324]) ).
thf(f324,plain,
( ( ( sK6 @ ( sK7 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) )
= ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) )
| ( $true != $true )
| ~ spl8_5 ),
inference(superposition,[],[f32,f97]) ).
thf(f323,plain,
( spl8_6
| spl8_13
| ~ spl8_14
| spl8_6 ),
inference(avatar_split_clause,[],[f314,f115,f320,f316,f115]) ).
thf(f314,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f313]) ).
thf(f313,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( $true != $true )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK5 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ sK4 ) @ sK4 ) ) ),
inference(superposition,[],[f105,f33]) ).
thf(f105,plain,
! [X2: 'type/nums/num',X0: sK2 > $o,X1: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) ) @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X2 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X2 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f104,plain,
! [X2: 'type/nums/num',X0: sK2 > $o,X1: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) ) @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X2 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X2 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) @ X0 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f103]) ).
thf(f103,plain,
! [X2: 'type/nums/num',X0: sK2 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X2 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) ) @ X0 ) )
| ( ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 )
!= ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X2 ) ) ),
inference(duplicate_literal_removal,[],[f101]) ).
thf(f101,plain,
! [X2: 'type/nums/num',X0: sK2 > $o,X1: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) @ X0 ) )
| ( ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 )
!= ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK2 @ ( sK0 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X2 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK7 @ ( sK1 @ sK2 @ sK3 @ sK7 @ sK6 @ sK5 @ X0 ) ) @ X0 ) ) ),
inference(superposition,[],[f25,f53]) ).
thf(f53,plain,
! [X0: $tType,X2: X0 > sK3,X3: X0 > $o,X1: sK3 > X0,X4: 'type/nums/num'] :
( ( ( sK1 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 )
= ( sK6 @ ( sK7 @ ( sK1 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 ) ) ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X4 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 ) @ X3 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 ) ) ),
inference(binary_proxy_clausification,[],[f52]) ).
thf(f52,plain,
! [X0: $tType,X2: X0 > sK3,X3: X0 > $o,X1: sK3 > X0,X4: 'type/nums/num'] :
( ( ( sK1 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 )
= ( sK6 @ ( sK7 @ ( sK1 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 ) ) ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X4 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 ) @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f51,plain,
! [X0: $tType,X2: X0 > sK3,X3: X0 > $o,X1: sK3 > X0,X4: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 ) @ X3 ) )
| ( ( sK1 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 )
= ( sK6 @ ( sK7 @ ( sK1 @ X0 @ sK3 @ X1 @ X2 @ sK5 @ X3 ) ) ) )
| ( $true != $true )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X4 ) ) ),
inference(superposition,[],[f32,f24]) ).
thf(f233,plain,
( ~ spl8_4
| spl8_10 ),
inference(avatar_contradiction_clause,[],[f232]) ).
thf(f232,plain,
( $false
| ~ spl8_4
| spl8_10 ),
inference(subsumption_resolution,[],[f231,f92]) ).
thf(f231,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) )
| spl8_10 ),
inference(trivial_inequality_removal,[],[f230]) ).
thf(f230,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) )
| ( $true != $true )
| spl8_10 ),
inference(superposition,[],[f218,f28]) ).
thf(f218,plain,
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) ) @ sK5 ) )
| spl8_10 ),
inference(avatar_component_clause,[],[f216]) ).
thf(f200,plain,
( ~ spl8_1
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f199,f88,f39]) ).
thf(f39,plain,
( spl8_1
<=> ( $true
= ( 'const/sets/FINITE' @ sK2 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
thf(f199,plain,
( ( $true
!= ( 'const/sets/FINITE' @ sK2 @ sK4 ) )
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f167,f31]) ).
thf(f167,plain,
( ( $true
!= ( 'const/sets/FINITE' @ sK2 @ sK4 ) )
| ( ( 'const/sets/CARD' @ sK3 @ sK5 )
= ( 'const/sets/CARD' @ sK2 @ sK4 ) )
| ~ spl8_3 ),
inference(trivial_inequality_removal,[],[f160]) ).
thf(f160,plain,
( ( ( 'const/sets/CARD' @ sK3 @ sK5 )
= ( 'const/sets/CARD' @ sK2 @ sK4 ) )
| ( $true
!= ( 'const/sets/FINITE' @ sK2 @ sK4 ) )
| ( $true = $false )
| ~ spl8_3 ),
inference(superposition,[],[f37,f149]) ).
thf(f149,plain,
( ! [X0: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( ( 'const/sets/CARD' @ sK3 @ sK5 )
= X0 ) )
| ~ spl8_3 ),
inference(trivial_inequality_removal,[],[f130]) ).
thf(f130,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/CARD' @ sK3 @ sK5 )
= X0 )
| ( $true != $true )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) ) )
| ~ spl8_3 ),
inference(superposition,[],[f36,f89]) ).
thf(f89,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) ) )
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f88]) ).
thf(f118,plain,
( spl8_5
| spl8_3
| spl8_4 ),
inference(avatar_split_clause,[],[f113,f91,f88,f95]) ).
thf(f113,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| spl8_4 ),
inference(binary_proxy_clausification,[],[f111]) ).
thf(f111,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| spl8_4 ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f110,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| ( $true != $true )
| ( ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) )
| spl8_4 ),
inference(superposition,[],[f93,f24]) ).
thf(f93,plain,
( ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) )
| spl8_4 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f98,plain,
( spl8_3
| ~ spl8_4
| spl8_3
| spl8_5 ),
inference(avatar_split_clause,[],[f86,f95,f88,f91,f88]) ).
thf(f86,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f85,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK5 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ sK5 @ X1 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $true != $true )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK2 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ sK5 ) @ sK4 ) ) ),
inference(superposition,[],[f72,f28]) ).
thf(f72,plain,
! [X2: 'type/nums/num',X0: sK3 > $o,X1: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) ) @ X0 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X2 ) )
| ( ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) @ X0 )
= $true )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X2 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f71]) ).
thf(f71,plain,
! [X2: 'type/nums/num',X0: sK3 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) @ X0 )
= $true )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X2 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) ) @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
! [X2: 'type/nums/num',X0: sK3 > $o,X1: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X2 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) ) @ X0 ) )
| ( ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 )
!= ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) )
| ( ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X2 ) ) ),
inference(duplicate_literal_removal,[],[f65]) ).
thf(f65,plain,
! [X2: 'type/nums/num',X0: sK3 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X1 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X2 ) )
| ( ( 'const/sets/IN' @ sK3 @ ( sK0 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) @ X0 )
= $true )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK3 @ X0 @ X2 ) )
| ( ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 )
!= ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK3 @ ( sK6 @ ( sK1 @ sK3 @ sK2 @ sK6 @ sK7 @ sK4 @ X0 ) ) @ X0 ) ) ),
inference(superposition,[],[f25,f49]) ).
thf(f49,plain,
! [X0: $tType,X2: X0 > sK2,X3: X0 > $o,X1: sK2 > X0,X4: 'type/nums/num'] :
( ( ( sK7 @ ( sK6 @ ( sK1 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) ) )
= ( sK1 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) @ X3 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 ) )
| ( $false
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X4 ) ) ),
inference(binary_proxy_clausification,[],[f48]) ).
thf(f48,plain,
! [X0: $tType,X2: X0 > sK2,X3: X0 > $o,X1: sK2 > X0,X4: 'type/nums/num'] :
( ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) @ X3 ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X4 ) )
| ( ( sK7 @ ( sK6 @ ( sK1 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) ) )
= ( sK1 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f47,plain,
! [X0: $tType,X2: X0 > sK2,X3: X0 > $o,X1: sK2 > X0,X4: 'type/nums/num'] :
( ( $true != $true )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= ( 'const/sets/HAS_SIZE' @ sK2 @ sK4 @ X4 ) )
| ( ( sK7 @ ( sK6 @ ( sK1 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) ) )
= ( sK1 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ sK2 @ X1 @ X2 @ sK4 @ X3 ) @ X3 ) ) ),
inference(superposition,[],[f29,f24]) ).
thf(f46,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f30,f43,f39]) ).
thf(f30,plain,
( ( $true
= ( 'const/sets/FINITE' @ sK2 @ sK4 ) )
| ( $true
= ( 'const/sets/FINITE' @ sK3 @ sK5 ) ) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SEV491^1 : TPTP v8.1.2. Released v7.0.0.
% 0.02/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 11:45:03 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TH1_THM_EQU_NAR problem
% 0.11/0.31 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.LvEyTWJTzM/Vampire---4.8_6330
% 0.17/0.33 % (6441)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.17/0.33 % (6443)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.17/0.33 % (6444)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.17/0.33 % (6442)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.17/0.33 % (6440)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.17/0.33 % (6438)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.17/0.33 % (6439)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.17/0.33 % (6445)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.17/0.33 % Exception at run slice level
% 0.17/0.33 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.33 % (6441)Instruction limit reached!
% 0.17/0.33 % (6441)------------------------------
% 0.17/0.33 % (6441)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.33 % (6441)Termination reason: Unknown
% 0.17/0.33 % (6441)Termination phase: Property scanning
% 0.17/0.33
% 0.17/0.33 % (6441)Memory used [KB]: 1023
% 0.17/0.33 % (6441)Time elapsed: 0.003 s
% 0.17/0.33 % (6441)Instructions burned: 3 (million)
% 0.17/0.33 % (6441)------------------------------
% 0.17/0.33 % (6441)------------------------------
% 0.17/0.33 % (6445)Instruction limit reached!
% 0.17/0.33 % (6445)------------------------------
% 0.17/0.33 % (6445)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.33 % (6445)Termination reason: Unknown
% 0.17/0.33 % (6445)Termination phase: Saturation
% 0.17/0.33
% 0.17/0.33 % (6445)Memory used [KB]: 1023
% 0.17/0.33 % (6445)Time elapsed: 0.003 s
% 0.17/0.33 % (6445)Instructions burned: 3 (million)
% 0.17/0.33 % (6445)------------------------------
% 0.17/0.33 % (6445)------------------------------
% 0.17/0.33 % (6439)Instruction limit reached!
% 0.17/0.33 % (6439)------------------------------
% 0.17/0.33 % (6439)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.33 % (6439)Termination reason: Unknown
% 0.17/0.33 % (6439)Termination phase: Saturation
% 0.17/0.33
% 0.17/0.33 % (6439)Memory used [KB]: 5500
% 0.17/0.33 % (6439)Time elapsed: 0.004 s
% 0.17/0.33 % (6439)Instructions burned: 4 (million)
% 0.17/0.33 % (6439)------------------------------
% 0.17/0.33 % (6439)------------------------------
% 0.17/0.34 % (6444)Instruction limit reached!
% 0.17/0.34 % (6444)------------------------------
% 0.17/0.34 % (6444)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.34 % (6444)Termination reason: Unknown
% 0.17/0.34 % (6444)Termination phase: Saturation
% 0.17/0.34
% 0.17/0.34 % (6444)Memory used [KB]: 5628
% 0.17/0.34 % (6444)Time elapsed: 0.012 s
% 0.17/0.34 % (6444)Instructions burned: 19 (million)
% 0.17/0.34 % (6444)------------------------------
% 0.17/0.34 % (6444)------------------------------
% 0.17/0.34 % (6440)Instruction limit reached!
% 0.17/0.34 % (6440)------------------------------
% 0.17/0.34 % (6440)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.34 % (6440)Termination reason: Unknown
% 0.17/0.34 % (6440)Termination phase: Saturation
% 0.17/0.34
% 0.17/0.34 % (6440)Memory used [KB]: 5628
% 0.17/0.34 % (6440)Time elapsed: 0.015 s
% 0.17/0.34 % (6440)Instructions burned: 27 (million)
% 0.17/0.34 % (6440)------------------------------
% 0.17/0.34 % (6440)------------------------------
% 0.17/0.34 % (6446)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.17/0.34 % (6447)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on Vampire---4 for (2999ds/15Mi)
% 0.17/0.34 % Exception at run slice level
% 0.17/0.34 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.34 % (6448)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.17/0.35 % (6448)Instruction limit reached!
% 0.17/0.35 % (6448)------------------------------
% 0.17/0.35 % (6448)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.35 % (6449)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on Vampire---4 for (2999ds/1041Mi)
% 0.17/0.35 % (6448)Termination reason: Unknown
% 0.17/0.35 % (6448)Termination phase: Saturation
% 0.17/0.35
% 0.17/0.35 % (6448)Memory used [KB]: 5500
% 0.17/0.35 % (6448)Time elapsed: 0.003 s
% 0.17/0.35 % (6448)Instructions burned: 3 (million)
% 0.17/0.35 % (6448)------------------------------
% 0.17/0.35 % (6448)------------------------------
% 0.17/0.35 % Exception at run slice level
% 0.17/0.35 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.35 % (6447)Instruction limit reached!
% 0.17/0.35 % (6447)------------------------------
% 0.17/0.35 % (6447)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.35 % (6447)Termination reason: Unknown
% 0.17/0.35 % (6447)Termination phase: Saturation
% 0.17/0.35
% 0.17/0.35 % (6447)Memory used [KB]: 5628
% 0.17/0.35 % (6447)Time elapsed: 0.009 s
% 0.17/0.35 % (6447)Instructions burned: 15 (million)
% 0.17/0.35 % (6447)------------------------------
% 0.17/0.35 % (6447)------------------------------
% 0.17/0.35 % (6450)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.17/0.35 % (6451)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on Vampire---4 for (2999ds/16Mi)
% 0.17/0.35 % (6450)Instruction limit reached!
% 0.17/0.35 % (6450)------------------------------
% 0.17/0.35 % (6450)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.35 % (6450)Termination reason: Unknown
% 0.17/0.35 % (6450)Termination phase: Saturation
% 0.17/0.35
% 0.17/0.35 % (6450)Memory used [KB]: 1023
% 0.17/0.35 % (6450)Time elapsed: 0.005 s
% 0.17/0.35 % (6450)Instructions burned: 7 (million)
% 0.17/0.35 % (6450)------------------------------
% 0.17/0.35 % (6450)------------------------------
% 0.17/0.36 % (6452)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.17/0.36 % (6452)Instruction limit reached!
% 0.17/0.36 % (6452)------------------------------
% 0.17/0.36 % (6452)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (6452)Termination reason: Unknown
% 0.17/0.36 % (6452)Termination phase: Property scanning
% 0.17/0.36
% 0.17/0.36 % (6452)Memory used [KB]: 1023
% 0.17/0.36 % (6452)Time elapsed: 0.003 s
% 0.17/0.36 % (6452)Instructions burned: 3 (million)
% 0.17/0.36 % (6452)------------------------------
% 0.17/0.36 % (6452)------------------------------
% 0.17/0.36 % (6453)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.17/0.36 % (6454)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.17/0.36 % (6453)Instruction limit reached!
% 0.17/0.36 % (6453)------------------------------
% 0.17/0.36 % (6453)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (6453)Termination reason: Unknown
% 0.17/0.36 % (6453)Termination phase: Preprocessing 3
% 0.17/0.36
% 0.17/0.36 % (6453)Memory used [KB]: 1023
% 0.17/0.36 % (6453)Time elapsed: 0.003 s
% 0.17/0.36 % (6453)Instructions burned: 3 (million)
% 0.17/0.36 % (6453)------------------------------
% 0.17/0.36 % (6453)------------------------------
% 0.17/0.36 % (6451)Instruction limit reached!
% 0.17/0.36 % (6451)------------------------------
% 0.17/0.36 % (6451)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (6451)Termination reason: Unknown
% 0.17/0.36 % (6451)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (6451)Memory used [KB]: 5628
% 0.17/0.36 % (6451)Time elapsed: 0.010 s
% 0.17/0.36 % (6451)Instructions burned: 16 (million)
% 0.17/0.36 % (6451)------------------------------
% 0.17/0.36 % (6451)------------------------------
% 0.17/0.36 % (6455)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.17/0.36 % (6454)Instruction limit reached!
% 0.17/0.36 % (6454)------------------------------
% 0.17/0.36 % (6454)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (6454)Termination reason: Unknown
% 0.17/0.36 % (6454)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (6454)Memory used [KB]: 5500
% 0.17/0.36 % (6454)Time elapsed: 0.005 s
% 0.17/0.36 % (6454)Instructions burned: 7 (million)
% 0.17/0.36 % (6454)------------------------------
% 0.17/0.36 % (6454)------------------------------
% 0.17/0.36 % Exception at run slice level
% 0.17/0.36 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.37 % (6456)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.17/0.37 % (6457)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.17/0.37 % (6456)Instruction limit reached!
% 0.17/0.37 % (6456)------------------------------
% 0.17/0.37 % (6456)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.37 % (6456)Termination reason: Unknown
% 0.17/0.37 % (6456)Termination phase: Saturation
% 0.17/0.37
% 0.17/0.37 % (6456)Memory used [KB]: 5500
% 0.17/0.37 % (6456)Time elapsed: 0.004 s
% 0.17/0.37 % (6456)Instructions burned: 5 (million)
% 0.17/0.37 % (6456)------------------------------
% 0.17/0.37 % (6456)------------------------------
% 0.17/0.37 % (6458)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on Vampire---4 for (2999ds/710Mi)
% 0.17/0.37 % (6459)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on Vampire---4 for (2999ds/6Mi)
% 0.17/0.37 % (6460)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on Vampire---4 for (2999ds/902Mi)
% 0.17/0.38 % (6461)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on Vampire---4 for (2999ds/21Mi)
% 0.17/0.38 % (6459)Instruction limit reached!
% 0.17/0.38 % (6459)------------------------------
% 0.17/0.38 % (6459)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.38 % (6459)Termination reason: Unknown
% 0.17/0.38 % (6459)Termination phase: Saturation
% 0.17/0.38
% 0.17/0.38 % (6459)Memory used [KB]: 5500
% 0.17/0.38 % (6459)Time elapsed: 0.005 s
% 0.17/0.38 % (6459)Instructions burned: 6 (million)
% 0.17/0.38 % (6459)------------------------------
% 0.17/0.38 % (6459)------------------------------
% 0.17/0.38 % (6457)Instruction limit reached!
% 0.17/0.38 % (6457)------------------------------
% 0.17/0.38 % (6457)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.38 % (6457)Termination reason: Unknown
% 0.17/0.38 % (6457)Termination phase: Saturation
% 0.17/0.38
% 0.17/0.38 % (6457)Memory used [KB]: 5628
% 0.17/0.38 % (6457)Time elapsed: 0.011 s
% 0.17/0.38 % (6457)Instructions burned: 18 (million)
% 0.17/0.38 % (6457)------------------------------
% 0.17/0.38 % (6457)------------------------------
% 0.17/0.38 % (6462)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on Vampire---4 for (2999ds/5Mi)
% 0.17/0.38 % Exception at run slice level
% 0.17/0.38 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.39 % (6461)Instruction limit reached!
% 0.17/0.39 % (6461)------------------------------
% 0.17/0.39 % (6461)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.39 % (6461)Termination reason: Unknown
% 0.17/0.39 % (6461)Termination phase: Saturation
% 0.17/0.39
% 0.17/0.39 % (6461)Memory used [KB]: 5628
% 0.17/0.39 % (6461)Time elapsed: 0.013 s
% 0.17/0.39 % (6461)Instructions burned: 21 (million)
% 0.17/0.39 % (6461)------------------------------
% 0.17/0.39 % (6461)------------------------------
% 0.17/0.39 % (6463)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on Vampire---4 for (2999ds/6Mi)
% 0.17/0.39 % (6464)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on Vampire---4 for (2999ds/377Mi)
% 0.17/0.39 % Exception at run slice level
% 0.17/0.39 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.40 % (6465)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on Vampire---4 for (2999ds/779Mi)
% 0.17/0.40 % Exception at run slice level
% 0.17/0.40 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.40 % (6466)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on Vampire---4 for (2999ds/19Mi)
% 0.17/0.40 % Exception at run slice level
% 0.17/0.40 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.17/0.40 % (6467)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on Vampire---4 for (2999ds/879Mi)
% 0.17/0.41 % (6438)Instruction limit reached!
% 0.17/0.41 % (6438)------------------------------
% 0.17/0.41 % (6438)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.41 % (6438)Termination reason: Unknown
% 0.17/0.41 % (6438)Termination phase: Saturation
% 0.17/0.41
% 0.17/0.41 % (6438)Memory used [KB]: 6652
% 0.17/0.41 % (6438)Time elapsed: 0.081 s
% 0.17/0.41 % (6438)Instructions burned: 184 (million)
% 0.17/0.41 % (6438)------------------------------
% 0.17/0.41 % (6438)------------------------------
% 0.17/0.41 % (6468)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on Vampire---4 for (2999ds/17Mi)
% 0.17/0.41 % (6469)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.17/0.42 % (6469)Instruction limit reached!
% 0.17/0.42 % (6469)------------------------------
% 0.17/0.42 % (6469)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.42 % (6469)Termination reason: Unknown
% 0.17/0.42 % (6469)Termination phase: Property scanning
% 0.17/0.42
% 0.17/0.42 % (6469)Memory used [KB]: 1023
% 0.17/0.42 % (6469)Time elapsed: 0.004 s
% 0.17/0.42 % (6469)Instructions burned: 4 (million)
% 0.17/0.42 % (6469)------------------------------
% 0.17/0.42 % (6469)------------------------------
% 0.17/0.42 % (6468)Instruction limit reached!
% 0.17/0.42 % (6468)------------------------------
% 0.17/0.42 % (6468)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.42 % (6468)Termination reason: Unknown
% 0.17/0.42 % (6468)Termination phase: Saturation
% 0.17/0.42
% 0.17/0.42 % (6468)Memory used [KB]: 5628
% 0.17/0.42 % (6468)Time elapsed: 0.011 s
% 0.17/0.42 % (6468)Instructions burned: 17 (million)
% 0.17/0.42 % (6468)------------------------------
% 0.17/0.42 % (6468)------------------------------
% 0.17/0.42 % (6470)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on Vampire---4 for (2999ds/30Mi)
% 0.17/0.42 % (6443)First to succeed.
% 0.17/0.43 % (6471)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on Vampire---4 for (2998ds/127Mi)
% 0.17/0.43 % (6443)Refutation found. Thanks to Tanya!
% 0.17/0.43 % SZS status Theorem for Vampire---4
% 0.17/0.43 % SZS output start Proof for Vampire---4
% See solution above
% 0.17/0.43 % (6443)------------------------------
% 0.17/0.43 % (6443)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.43 % (6443)Termination reason: Refutation
% 0.17/0.43
% 0.17/0.43 % (6443)Memory used [KB]: 6012
% 0.17/0.43 % (6443)Time elapsed: 0.104 s
% 0.17/0.43 % (6443)Instructions burned: 199 (million)
% 0.17/0.43 % (6443)------------------------------
% 0.17/0.43 % (6443)------------------------------
% 0.17/0.43 % (6437)Success in time 0.117 s
% 0.17/0.43 % Vampire---4.8 exiting
%------------------------------------------------------------------------------